Richard Brent And NotNouvelle-Zélande
List of bibliographic references
Number of relevant bibliographic references: 14.Ident. | Authors (with country if any) | Title |
---|---|---|
002833 | Richard Brent [Australie] ; Paul Zimmermann [France] | The Great Trinomial Hunt |
002B63 | Richard Brent [Australie] ; Paul Zimmermann [France] | An O(M(n) log n) algorithm for the Jacobi symbol |
003238 | Richard Brent ; Paul Zimmermann [France] | Modern Computer Arithmetic |
003C30 | Richard Brent ; Paul Zimmermann [France] | Ten new primitive binary trinomials |
004018 | Richard Brent [Australie] ; Pierrick Gaudry [France] ; Emmanuel Thomé [France] ; Paul Zimmermann [France] | Faster Multiplication in GF(2)[x] |
004202 | Richard Brent [Australie] ; Paul Zimmermann [France] | A Multi-level Blocking Distinct Degree Factorization Algorithm |
004846 | Richard Brent ; Paul Zimmermann [France] | A Multi-level Blocking Distinct Degree Factorization Algorithm |
004A67 | Richard Brent ; Colin Percival ; Paul Zimmermann [France] | Error Bounds on Complex Floating-Point Multiplication |
005255 | Richard Brent ; Colin Percival ; Paul Zimmermann [France] | Errors Bounds on Complex Floating-Point Multiplication |
006004 | Richard Brent ; Samuli Larvala ; Paul Zimmermann | A Primitive Trinomial of Degree 6972593 |
007503 | Richard Brent ; Paul Zimmermann | Random number generators with period divisible by a Mersenne prime |
007581 | Richard Brent ; Paul Zimmermann | Algorithms for finding almost irreducible and almost primitive trinomials |
007D63 | Richard Brent [France] ; Paul Zimmermann [France] | Random number generators with period divisible by a Mersenne prime |
007E74 | Richard Brent [France] ; Paul Zimmermann [France] | Algorithms for finding almost irreducible and almost primitive trinomials |
This area was generated with Dilib version V0.6.33. |